Near-Optimal Detection for Binary Tardos Code by Estimating Collusion Strategy
نویسندگان
چکیده
منابع مشابه
Estimating the Minimal Length of Tardos Code
This paper estimates the minimal length of a binary probabilistic traitor tracing code. We consider the code construction proposed by G. Tardos in 2003, with the symmetric accusation function as improved by B. Skoric et al. The length estimation is based on two pillars. First, we consider the Worst Case Attack that a group of c colluders can lead. This attack minimizes the mutual information be...
متن کاملBinary forensic code for multimedia signals: resisting minority collusion attacks
Digital forensic marking is a technology to discourage unauthorized redistribution of multimedia signals by embedding a unique mark into each user’s copy of the content. A powerful class of attacks on forensic marking is the collusion attack by a group of users. Recently, a new collusion attack, called the minority attack, has been proposed against forensic marking schemes with correlation-base...
متن کاملNear-Optimal Compressive Binary Search
We propose a simple modification to the recently proposed compressive binary search [1]. The modification removes an unnecessary and suboptimal factor of log log n from the SNR requirement, making the procedure optimal (up to a small constant). Simulations show that the new procedure performs significantly better in practice as well. We also contrast this problem with the well known noisy binar...
متن کاملBinary code-based Human Detection
HOG features are effective for object detection, but their focus on local regions makes them highdimensional features. To reduce the memory required for the HOG features, this paper proposes a new feature, R-HOG, which creates binary codes from the HOG features extracted from two local regions. This approach enables the created binary codes to reflect the relationships between local regions. Co...
متن کاملBinary and q-ary Tardos codes, revisited
The Tardos code is a much studied collusion-resistant fingerprinting code, with the special property that it has asymptotically optimal length m ∝ c0, where c0 is the number of colluders. In this paper we give alternative security proofs for the Tardos code, working with the assumption that the strongest coalition strategy is position-independent. We employ the Bernstein inequality and Bennett ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Forensics and Security
سال: 2020
ISSN: 1556-6013,1556-6021
DOI: 10.1109/tifs.2019.2956587